Перевод и анализ слов искусственным интеллектом ChatGPT

На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:

как употребляется слово
частота употребления
используется оно чаще в устной или письменной речи
варианты перевода слова
примеры употребления (несколько фраз с переводом)
этимология

Что (кто) такое shifted recursion - определение

Shifted gompertz; Shifted Gompertz; Shifted Gompertz Distribution

Найдено результатов: 76

Tail call

SUBROUTINE THAT CALLS ITSELF AS ITS FINAL ACTION

Tail recursion; Tail recursion modulo cons; Tail-recursive; Tail recursive; Tail call optimization; Tail Recursion; Tail-call optimization; Tailcall; Tail-call optimisation; Tail-call elimination; Tail-recursion; Tail-end recursion; Tail call elimination; Tail recursion elimination; Tail recursion optimization; Tail-recursion optimization; Proper tail recursion; Tail function; Tail recursive function; Tail-recursive function

In computer science, a tail call is a subroutine call performed as the final action of a procedure. If the target of a tail is the same subroutine, the subroutine is said to be tail recursive, which is a special case of direct recursion.

https://en.wikipedia.org/wiki/Tail_call

tail recursion

SUBROUTINE THAT CALLS ITSELF AS ITS FINAL ACTION

<programming> When the last thing a function (or procedure) does is to call itself. Such a function is called tail recursive. A function may make several recursive calls but a call is only tail-recursive if the caller returns immediately after it. E.g. f n = if n < 2 then 1 else f (f (n-2) + 1) In this example both calls to f are recursive but only the outer one is tail recursive. Tail recursion is a useful property because it enables {tail recursion optimisation}. If you aren't sick of them already, see recursion and {tail recursion}. [Jargon File] (2006-04-16)

tail call optimization

SUBROUTINE THAT CALLS ITSELF AS ITS FINAL ACTION

last call optimisation

tail recursion modulo cons

SUBROUTINE THAT CALLS ITSELF AS ITS FINAL ACTION

<programming, compiler> A generalisation of tail recursion introduced by D.H.D. Warren. It applies when the last thing a function does is to apply a constructor functions (e.g. cons) to an application of a non-primitive function. This is transformed into a tail call to the function which is also passed a pointer to where its result should be written. E.g. f [] = [] f (x:xs) = 1 : f xs is transformed into (pseudo C/Haskell): f [] = [] f l = f' l allocate_cons f' [] p = { *p = nil; return *p } f' (x:xs) p = { cell = allocate_cons; *p = cell; cell.head = 1; return f' xs &cell.tail } where allocate_cons returns the address of a new cons cell, *p is the location pointed to by p and &c is the address of c. [D.H.D. Warren, DAI Research Report 141, University of Edinburgh 1980]. (1995-03-06)

recursive

$The [[Sierpinski triangle]]—a confined recursion of triangles that form a fractal$